Rectangle packing with additional restrictions
نویسندگان
چکیده
منابع مشابه
Optimal rectangle packing
We consider the NP-complete problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. We present two different constraintsatisfaction formulations of this problem. The first searches a space of absolute placements of rectangles in the enclosing rectangle, while the other searches a space of relative placements between pairs of rectangles. Both appr...
متن کاملOn Weighted Rectangle Packing with Large Resources
We study the problem of packing a set of n rectangles with weights into a dedicated rectangle so that the weight of the packed rectangles is maximized. We consider the case of large resources, that is, the side length of all rectangles is at most 1 and the side lengths of the dedicated rectangle differ by a factor of at least 1="4, for a fixed positive " > 0. We present an algorithm which finds...
متن کاملWeighted Rectangle and Cuboid Packing
Given a set of rectangular items, all of them associated with a profit, and a single bigger rectangular bin, we can ask to find a non-rotational, non-overlapping packing of a selection of these items into the bin to maximize the profit. A detailed description of the (2 + )-approximation algorithm of Jansen and Zhang [8] for the twodimensional case is given. Furthermore we derive a (16 + )-appro...
متن کاملSearch Strategies for Rectangle Packing
Rectangle (square) packing problems involve packing all squares with sizes 1 × 1 to n × n into the minimum area enclosing rectangle (respectively, square). Rectangle packing is a variant of an important problem in a variety of real-world settings. For example, in electronic design automation, the packing of blocks into a circuit layout is essentially a rectangle packing problem. Rectangle packi...
متن کاملOptimal Rectangle Packing: New Results
We present new results on the problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. Many simple scheduling tasks can be modelled by this NP-complete problem. We present a new lower bound on the amount of wasted space in a partial solution, a new dominance condition that prunes many partial solutions, and extend our algorithms to packing unorien...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.09.007